7 J an 2 00 4 On the Global Minimization of the Value - at - Risk ∗ Jong - Shi Pang
نویسندگان
چکیده
In this paper, we consider the nonconvex minimization problem of the value-at-risk (VaR) that arises from financial risk analysis. By considering this problem as a special linear program with linear complementarity constraints (a bilevel linear program to be more precise), we develop upper and lower bounds for the minimum VaR and show how the combined bounding procedures can be used to compute the latter value to global optimality. A numerical example is provided to illustrate the methodology. Dedication. With great pleasure we dedicate this paper to a respected pioneer of our field, Professor Olvi L. Mangasarian, on the occasion of his 70th birthday. The two topics of this paper, LPECs and smoothing methods, are examples of the vast contributions that Olvi has made in optimization, which have benefited us in many ways and which will continue to benefit us in the future. Happy 70th birthday, Olvi!
منابع مشابه
On the global minimization of the value-at-risk
In this paper we consider the nonconvex minimization problem of the value at risk VaR that arises from nancial risk analysis By considering this problem as a special linear program with linear complementarity constraints a bilevel linear program to be more precise we develop upper and lower bounds for the minimumVaR and show how the combined bounding procedures can be used to compute the latter...
متن کاملPortfolio Optimization Based on Cross Efficiencies By Linear Model of Conditional Value at Risk Minimization
Markowitz model is the first modern formulation of portfolio optimization problem. Relyingon historical return of stocks as basic information and using variance as a risk measure aretow drawbacks of this model. Since Markowitz model has been presented, many effortshave been done to remove theses drawbacks. On one hand several better risk measures havebeen introduced and proper models have been ...
متن کاملOn linear programs with linear complementarity constraints
The paper is a manifestation of the fundamental importance of the linear program with linear complementarity constraints (LPCC) in disjunctive and hierarchical programming as well as in some novel paradigms of mathematical programming. In addition to providing a unified framework for bilevel and inverse linear optimization, nonconvex piecewise linear programming, indefinite quadratic programs, ...
متن کاملLow order-value approach for solving VaR-constrained optimization problems
In low order-value optimization (LOVO) problems the sum of the r smallest values of a finite sequence of q functions is involved as the objective to be minimized or as a constraint. The latter case is considered in the present paper. Portfolio optimization problems with a constraint on the admissible Value-at-Risk (VaR) can be modeled in terms of LOVOconstrained minimization. Different algorith...
متن کاملRobust portfolio selection with polyhedral ambiguous inputs
Ambiguity in the inputs of the models is typical especially in portfolio selection problem where the true distribution of random variables is usually unknown. Here we use robust optimization approach to address the ambiguity in conditional-value-at-risk minimization model. We obtain explicit models of the robust conditional-value-at-risk minimization for polyhedral and correlated polyhedral am...
متن کامل